Hoare Logic with Updates A Hoare-Style Calculus with Explicit State Updates
نویسندگان
چکیده
We present a verification system for a variant of Hoare-logic that supports proving program correctness by forward symbolic execution. No explicit weakening rules are needed and first-order reasoning is automated. The system is suitable for teaching program verification, because the student can concentrate on reasoning about programs following their natural control flow and proofs are machine-checked.
منابع مشابه
A Hoare-Style Calculus with Explicit State Updates
We present a verification system for a variant of Hoare-logic that supports proving by forward symbolic execution. In addition, no explicit weakening rules are needed and first-order reasoning is automated. The system is suitable for teaching program verification, because the student can concentrate on reasoning about programs following their natural control flow and proofs are machine-checked.
متن کاملA Context Logic for Tree Update
Spatial logics have been used to describe properties of tree-like structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separation Logic). We integrate this work by analyzing dynamic updates to tree structures with pointers (such as XML with identifiers and idrefs). Naı̈ve adaptations of the previous logics are not expressive enough to capture s...
متن کاملReasoning About States of Probabilistic Sequential Programs
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-style calculus for basic probabilistic sequential programs. The Hoare calculus presented herein is the first probabilistic Hoare calculus with a complete and decidable state logic that has truth-functional propositional (...
متن کاملReasoning about probabilistic sequential programs 1
A complete and decidable Hoare-style calculus for iteration-free probabilistic sequential programs is presented using a state logic with truth-functional propositional (not arithmetical) connectives.
متن کاملReasoning about probabilistic sequential programs
A complete and decidable Hoare-style calculus for iteration-free prob-abilistic sequential programs is presented using a state logic with truth-functional propositional (not arithmetical) connectives.
متن کامل